General least gradient problems with obstacle
نویسندگان
چکیده
منابع مشابه
The Obstacle Problem for Functions of Least Gradient
For a given domain Ω ⊂ n , we consider the variational problem of minimizing the L1-norm of the gradient on Ω of a function u with prescribed continuous boundary values and satisfying a continuous lower obstacle condition u ψ inside Ω. Under the assumption of strictly positive mean curvature of the boundary ∂Ω, we show existence of a continuous solution, with Hölder exponent half of that of dat...
متن کاملGradient methods and conic least-squares problems
This paper presents two reformulations of the dual of the constrained least squares problem over convex cones. In addition, it extends Nesterov’s excessive gap method 1 [21] to more general problems. The conic least squares problem is then solved by applying the resulting modified method, or Nesterov’s smooth method [22], or Nesterov’s excessive gap method 2 [21], to the dual reformulations. Nu...
متن کاملA General Formulation for Least-Squares Problems
Abstract — We show in this paper that many different least-squares problems which have applications in signal processing may be seen as special cases of a more general vector space minimization problem called the Minimum Norm problem. We show that special cases of the Minimum Norm problem include: least squares fitting of a finite set of points to a linear equation and to a quadratic equation; ...
متن کاملStochastic conjugate gradient method for least-square seismic inversion problems
With the development of computational power, there has been an increased focus on data-fitting related seismic inversion techniques for high fidelity seismic velocity model and image, such as full-waveform inversion and least square migration. However, though more advanced than conventional methods, these data fitting methods can be very expensive in terms of computational cost. Recently, vario...
متن کاملAn L1 Penalty Method for General Obstacle Problems
We construct an efficient numerical scheme for solving obstacle problems in divergence form. The numerical method is based on a reformulation of the obstacle in terms of an L1-like penalty on the variational problem. The reformulation is an exact regularizer in the sense that for a large (but finite) penalty parameter, we recover the exact solution. Our formulation is applied to classical ellip...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Calculus of Variations and Partial Differential Equations
سال: 2019
ISSN: 0944-2669,1432-0835
DOI: 10.1007/s00526-019-1635-8